翻訳と辞書 Words near each other ・ Combination square ・ Combination stair ・ Combination Steel and Iron Company ・ Combination therapy ・ Combination tone ・ Combination weapons ・ Combination Women's Football Leagues ・ Combinational logic ・ Combinations (album) ・ Combinations of Workmen Act 1825 ・ Combinator library ・ Combinatorial auction ・ Combinatorial biology ・ Combinatorial chemistry ・ Combinatorial Chemistry & High Throughput Screening ・ Combinatorial class ・ Combinatorial commutative algebra ・ Combinatorial data analysis ・ Combinatorial design ・ Combinatorial explosion ・ Combinatorial game theory ・ Combinatorial group theory ・ Combinatorial hierarchy ・ Combinatorial map ・ Combinatorial meta-analysis ・ Combinatorial method ・ Combinatorial method (linguistics) ・ Combinatorial number system ・ Combinatorial optimization ・ Combinatorial principles Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Combinatorial class ： ウィキペディア英語版 Combinatorial class In mathematics, a combinatorial class is a countable set of mathematical objects, together with a size function mapping each object to a non-negative integer, such that there are finitely many objects of each size.〔.〕〔.〕 ==Counting sequences and isomorphism== The ''counting sequence'' of a combinatorial class is the sequence of the numbers of elements of size ''i'' for ''i'' = 0, 1, 2, ...; it may also be described as a generating function that has these numbers as its coefficients. The counting sequences of combinatorial classes are the main subject of study of enumerative combinatorics. Two combinatorial classes are said to be isomorphic if they have the same numbers of objects of each size, or equivalently, if their counting sequences are the same.〔.〕 Frequently, once two combinatorial classes are known to be isomorphic, a bijective proof of this equivalence is sought; such a proof may be interpreted as showing that the objects in the two isomorphic classes are cryptomorphic to each other. For instance, the triangulations of regular polygons (with size given by the number of sides of the polygon, and a fixed choice of polygon to triangulate for each size) and the set of unrooted binary plane trees (up to graph isomorphism, with a fixed ordering of the leaves, and with size given by the number of leaves) are both counted by the Catalan numbers, so they form isomorphic combinatorial classes. A bijective isomorphism in this case is given by planar graph duality: a triangulation can be transformed bijectively into a tree with a leaf for each polygon edge, an internal node for each triangle, and an edge for each two polygon edges or triangles that are adjacent to each other.〔.〕 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Combinatorial class」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.